منابع مشابه
Critical behavior in lossy source coding
The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O( √ n) or O(logn). We show it is always O( √ n), except for discrete, uniformly distributed sources. Keywords—Redundancy, rate-distortion theory, lossy data compression
متن کاملSystematic Lossy Source/Channel Coding
The fundamental limits of “systematic” communication are analyzed. In systematic transmission, the decoder has access to a noisy version of the uncoded raw data (analog or digital). The coded version of the data is used to reduce the average reproduced distortion D below that provided by the uncoded systematic link and/or increase the rate of information transmission. Unlike the case of arbitra...
متن کاملEntropy Approximation in Lossy Source Coding Problem
In this paper, we investigate a lossy source coding problem, where an upper limit on the permitted distortion is defined for every dataset element. It can be seen as an alternative approach to rate distortion theory where a bound on the allowed average error is specified. In order to find the entropy, which gives a statistical length of source code compatible with a fixed distortion bound, a co...
متن کاملCoeecient Rate and Lossy Source Coding
Campbelll1] derived and deened a quantity called the coeecient rate of a random process that involves the process spectral entropy. Two new derivations of Campbell's coeecient rate are given here. One derivation solidiies the interpretation of this quantity as a coeecient rate, while the second derivation implies a new approach for source compression. We investigate this new approach for transf...
متن کاملTHE SpEnt METHOD FOR LOSSY SOURCE CODING †
At present, the most successful methods for lossy source compression are sample-function adaptive coders. Prominent examples of these techniques are the still image compression methods utilizing wavelet expansions and tree structures, such as the zero-tree method or the SPIHT algorithm, and variable rate speech coders that allocate bits to parameters within a frame based upon the classification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2001
ISSN: 0018-9448
DOI: 10.1109/18.915693